Strong stationary duality for Möbius monotone Markov chains
نویسندگان
چکیده
For Markov chains with a finite, partially ordered state space, we show strong stationary duality under the condition of Möbius monotonicity of the chain. We give examples of dual chains in this context which have no downwards transitions. We illustrate general theory by an analysis of nonsymmetric random walks on the cube with an interpretation for unreliable networks of queues.
منابع مشابه
Duality and Intertwining for Discrete Markov Kernels: a Relation and Examples
We work out some relations between duality and intertwining in the context of discrete Markov chains, fixing up the background of previous relations first established for birth and death chains and their Siegmund duals. In view of the results, the monotone properties resulting from the Siegmund dual of birth and death chains are revisited in some detail, with emphasis on the non neutral Moran m...
متن کاملDuality and Intertwining for discrete Markov kernels: relations and examples
We work out some relations between duality and intertwining in the context of discrete Markov chains, fixing up the background of previous relations first established for birth and death chains and their Siegmund duals. In view of the results, the monotone properties resulting from the Siegmund dual of birth and death chains are revisited in some detail, with emphasis on the non neutral Moran m...
متن کاملOn hitting times and fastest strong stationary times for skip-free chains
An (upward) skip-free Markov chain with the set of nonnegative integers as state space is a chain for which upward jumps may be only of unit size; there is no restriction on downward jumps. In a 1987 paper, Brown and Shao determined, for an irreducible continuous-time skip-free chain and any d, the passage time distribution from state 0 to state d. When the nonzero eigenvalues νj of the generat...
متن کاملConvergence rates in monotone separable stochastic networks
We study bounds on the rate of convergence to the stationary distribution in monotone separable networks which are represented in terms of stochastic recursive sequences. Monotonicity properties of this subclass of Markov chains allow us to formulate conditions in terms of marginal network characteristics. Two particular examples, generalized Jackson networks and multiserver queues, are conside...
متن کاملOn hitting times and fastest strong stationary times for skip-free and more general chains
An (upward) skip-free Markov chain with the set of nonnegative integers as state space is a chain for which upward jumps may be only of unit size; there is no restriction on downward jumps. In a 1987 paper, Brown and Shao determined, for an irreducible continuous-time skip-free chain and any d, the passage time distribution from state 0 to state d. When the nonzero eigenvalues νj of the generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 71 شماره
صفحات -
تاریخ انتشار 2012